{	Problem: http://codeforces.ru/problemset/problem/108/B
	Verdict: Accepted
}
var
    i, j, n, xx, yy : longint;
    a : array[-100..100100] of longint;

procedure sort(l, r : longint);

var
    i, j, x, y : longint;

begin
    i := l;
    j := r;
    x := a[(l + r) shr 1];
    repeat
        while a[i] < x do inc(i);
        while a[j] > x do dec(j);
        if i <= j then begin
            y := a[i];
            a[i] := a[j];
            a[j] := y;
            inc(i);
            dec(j);
        end;
    until i > j;
    if l < j then sort(l, j);
    if i < r then sort(i, r);
end;    

begin 
    readln(n);
    for i := 1 to n do read(a[i]);
    sort(1, n);
                for i := 2 to n do
                        if (a[i] < a[i - 1] * 2) and (a[i] <> a[i - 1]) then begin
                                writeln('YES');
                                halt(0);
                        end;
    writeln('NO');
end.
